The Foundational Cryptography Framework
نویسندگان
چکیده
We present the Foundational Cryptography Framework (FCF) for developing and checking complete proofs of security for cryptographic schemes within a proof assistant. This is a general-purpose framework that is capable of modeling and reasoning about a wide range of cryptographic schemes, security definitions, and assumptions. Security is proven in the computational model, and the proof provides concrete bounds as well as asymptotic conclusions. FCF provides a language for probabilistic programs, a theory that is used to reason about programs, and a library of tactics and definitions that are useful in proofs about cryptography. The framework is designed to leverage fully the existing theory and capabilities of the Coq proof assistant in order to reduce the effort required to develop proofs.
منابع مشابه
Pseudorandom Functions and Permutations Provably Secure against Related-Key Attacks
This paper fills an important foundational gap with the first proofs, under standard assumptions and in the standard model, of the existence of PRFs and PRPs resisting rich and relevant forms of relatedkey attack (RKA). An RKA allows the adversary to query the function not only under the target key but under other keys derived from it in adversary-specified ways. Based on the Naor-Reingold PRF ...
متن کاملMeanings of Foundational Virtue in Islamic Mystical Ethics: A Case Study of Honesty
In mystical ethics, some virtues have a foundational role in relation to other virtues; that is, other virtues are in some ways dependent on, conditional to, or rooted in them. This is a gradational concept, and therefore one can speak of foundational and more foundational among foundational virtues in mysticism. Honesty is the most foundational virtue in mystical ethics, and other virtues are ...
متن کاملOne-Time Pad, Arithmetic Coding and Logic Gates: An unifying theme using Dynamical Systems
In this letter, we prove that the perfectly secure One-Time Pad (OTP) encryption can be seen as finding the initial condition on the binary map under a random switch based on the perfectly random pad. This turns out to be a special case of Grangetto’s randomized arithmetic coding performed on the Binary Map. Furthermore, we derive the set of possible perfect secrecy systems using such an approa...
متن کاملGarbled Circuits as Randomized Encodings of Functions: a Primer
Yao’s garbled circuit (GC) construction is a central cryptographic tool with numerous applications. In this tutorial, we study garbled circuits from a foundational point of view under the framework of randomized encoding (RE) of Functions. We review old and new constructions of REs, present some lower-bounds, and describe some applications. We will also discuss new directions and open problems ...
متن کاملVerified Correctness and Security of OpenSSL HMAC
We have proved, with machine-checked proofs in Coq, that an OpenSSL implementation of HMAC with SHA256 correctly implements its FIPS functional specification and that its functional specification guarantees the expected cryptographic properties. This is the first machine-checked cryptographic proof that combines a source-program implementation proof, a compilercorrectness proof, and a cryptogra...
متن کامل